Counting solvable $S$-unit equations
نویسندگان
چکیده
We obtain upper bounds on the number of finite sets S \mathcal {S} primes below a given bound for which various alttext="2"> 2 encoding="application/x-tex">2 variable -unit equations have solution.
منابع مشابه
Solvable Sextic Equations
Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex number field C.
متن کاملCounting homomorphisms onto finite solvable groups
We present a method for computing the number of epimorphisms from a finitely presented group G to a finite solvable group Γ, which generalizes a formula of Gaschütz. Key to this approach are the degree 1 and 2 cohomology groups of G, with certain twisted coefficients. As an application, we count low-index subgroups of G. We also investigate the finite solvable quotients of the Baumslag-Solitar ...
متن کاملQuasi - Exactly - Solvable Differential Equations
A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis is given. The main result is that any operator with the above property must have a representation as a polynomial element of the universal enveloping algebra of the algebra of differential (difference) operators in finitedimensional represent...
متن کاملQuasi Exactly Solvable Difference Equations
Several explicit examples of quasi exactly solvable ‘discrete’ quantum mechanical Hamiltonians are derived by deforming the well-known exactly solvable Hamiltonians of one degree of freedom. These are difference analogues of the well-known quasi exactly solvable systems, the harmonic oscillator (with/without the centrifugal potential) deformed by a sextic potential and the 1/ sin x potential de...
متن کاملDetermining the small solutions to S-unit equations
In this paper we generalize the method of Wildanger for nding small solutions to unit equations to the case of S-unit equations. The method uses a minor generalization of the LLL based techniques used to reduce the bounds derived from transcendence theory, followed by an enumeration strategy based on the Fincke-Pohst algorithm. The method used reduces the computing time needed from MIPS years d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2021
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/15674